Graph-based exploration and clustering analysis of semantic spaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge-Based Graph Exploration Analysis

In a context where graph transformation is used to explore a space of possible solutions to a given problem, it is almost always necessary to inspect candidate solutions for relevant properties. This means that there is a need for a flexible mechanism to query not only graphs but also their evolution. In this paper we show how to use Prolog queries to analyse graph exploration. Queries can oper...

متن کامل

Storylines: Visual exploration and analysis in latent semantic spaces

Tasks in visual analytics differ from typical information retrieval tasks in fundamental ways. A critical part of a visual analytics is to ask the right questions when dealing with a diverse collection of information. In this article, we introduce the design and application of an integrated exploratory visualization system called Storylines. Storylines provides a framework to enable analysts vi...

متن کامل

Fuzzy clustering of semantic spaces

In this paper the GK` model for the construction of thesaurus classes based on fuzzy semantic association measure between index terms and concepts (thesaurus classes) is presented. The association measure is obtained on the basis of fuzzy semantic relations between

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Graph-Based Clustering for Semantic Classification of Onomatopoetic Words

This paper presents a method for semantic classication of onomatopoetic words like “ひゅーひゅー (hum)” and “からん ころん (clip clop)” which exist in every language, especially Japanese being rich in onomatopoetic words. We used a graph-based clustering algorithm called Newman clustering. The algorithm calculates a simple quality function to test whether a particular division is meaningful. The quality f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Network Science

سال: 2019

ISSN: 2364-8228

DOI: 10.1007/s41109-019-0228-y